#include <istream>
#include <vector>

using namespace std;

// https://leetcode.cn/contest/weekly-contest-452/problems/partition-array-into-two-equal-product-subsets/description/
// Q1. 等积子集的划分方案

class Solution {
public:
    bool checkEqualPartitions(vector<int>& nums, long long target) {
        double multiply = 1;
        for(int i = 0; i < nums.size(); i++){
            multiply *= nums[i];
        }
        return multiply == target * 1.0 * target;
    }
};
int main()
{
    return 0;
}